On the size of unanbiguous context-free grammarsWYROSTEK, P.Theoretical computer science. 1986, Vol 47, Num 1, pp 107-110, issn 0304-3975Article

A characterization of exponential-time languages by alternating context-free grammarsIBARRA, O. H; TAO JIANG; HUI WANG et al.Theoretical computer science. 1992, Vol 99, Num 2, pp 301-313, issn 0304-3975Article

On Greibach normal form constructionURBANEK, F. J.Theoretical computer science. 1985, Vol 40, Num 2-3, pp 315-317, issn 0304-3975Article

A note on pure grammarsMAGINEN, E.Information processing letters. 1986, Vol 23, Num 5, pp 271-274, issn 0020-0190Article

Computational representations of Herbrand models using grammarsMATZINGER, R.Lecture notes in computer science. 1997, pp 334-348, issn 0302-9743, isbn 3-540-63172-0Conference Paper

A parsing method for context-free languages using bottom-up lookahead computationWATANABE, Y; TOKUDA, T.Systems and computers in Japan. 1996, Vol 27, Num 10, pp 14-22, issn 0882-1666Article

Self-embbeding indexed grammarsPARCHMANN, R; DUSKE, J.Theoretical computer science. 1986, Vol 47, Num 2, pp 219-223, issn 0304-3975Article

NTS language are deterministic and congruentialBOASSON, L; SENIZERGUES, G.Journal of computer and system sciences (Print). 1985, Vol 31, Num 3, pp 332-342, issn 0022-0000Article

Efficient learning of regular tree languages and applicationsBESOMBES, Jérome; MARION, Jean-Yves.Knowledge discovery and discrete mathematics. International conferenceJIM'2003 : journées de l'informatique messine. 2003, pp 169-180, isbn 2-7261-1256-0, 12 p.Conference Paper

Context-free relations and their characteristicsSOUBEH, M; JAMAL AL-LABAN, M.Applied mathematics and computation. 1996, Vol 79, Num 2-3, pp 163-172, issn 0096-3003Article

An elementary proof of double Greibach normal form = Une démonstration élémentaire de la double forme normale de GreibachENGELFRIET, J.Information processing letters. 1992, Vol 44, Num 6, pp 291-293, issn 0020-0190Article

Nonterminal complexity of programmed grammarsFERNAU, Henning.Lecture notes in computer science. 2001, pp 202-213, issn 0302-9743, isbn 3-540-42121-1Conference Paper

Suffix languages in LR parsingSEYFARTH, B. R; BERMUDEZ, M. E.International journal of computer mathematics. 1995, Vol 55, Num 3-4, pp 135-153, issn 0020-7160Article

Balanced grammars and their languagesBERSTEL, Jean; BOASSON, Luc.Formal and natural computing-eessays dedicated to Grzegorz Rozenberg. Lecture notes in computer science. 2002, pp 3-25, issn 0302-9743, isbn 3-540-43190-XBook Chapter

Two-level grammar as a functional programming languageEDUPUGANTY, B; BRYANT, B. R.Computer journal (Print). 1989, Vol 32, Num 1, pp 36-44, issn 0010-4620Article

Strong bisimilarity and regularity of basic process algebra is PSPACE-hardSRBA, Jiri.Lecture notes in computer science. 2002, pp 716-727, issn 0302-9743, isbn 3-540-43864-5, 12 p.Conference Paper

Tree k-grammar models for natural language modelling and parsingVERDU-MAS, Jose L; FORCADA, Mikel L; CARRASCO, Rafael C et al.Lecture notes in computer science. 2002, pp 56-63, issn 0302-9743, isbn 3-540-44011-9, 8 p.Conference Paper

Graph operations and monadic second-order logic : A surveyCOURCELLE, Bruno.Lecture notes in computer science. 2000, pp 20-24, issn 0302-9743, isbn 3-540-41285-9Conference Paper

Regulation by valencesFERNAU, H; STIEBE, R.Lecture notes in computer science. 1997, pp 239-248, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Two-level contextual grammars : The internal caseMARTIN-VIDE, C; MIQUEL-VERGES, J; PAUN, G et al.Lecture notes in computer science. 1997, pp 388-397, issn 0302-9743, isbn 3-540-63437-1Conference Paper

On deciding readiness and failure equivalences for processesHUYNH, D. T; LU TIAN.Information and computation (Print). 1995, Vol 117, Num 2, pp 193-205, issn 0890-5401Article

A context-free grammar-driven, one-pass HMM-based continuous speech recognition methodNAKAGAWA, S; KAI, A.Systems and computers in Japan. 1994, Vol 25, Num 4, pp 92-102, issn 0882-1666Article

The translation power of top-down tree-to-graoh transducersENGELFRIET, J; VOGLER, H.Journal of computer and system sciences (Print). 1994, Vol 49, Num 2, pp 258-305, issn 0022-0000Article

A note on the complexity of deciding bisimilarity of normed unary processesHUYNH, D. T; LU TIAN.Theoretical computer science. 1994, Vol 131, Num 2, pp 441-448, issn 0304-3975Article

Tree-adjoining grammersComputational intelligence. 1994, Vol 10, Num 4, issn 0824-7935, 274 p.Serial Issue